-
1 general automaton
Большой англо-русский и русско-английский словарь > general automaton
-
2 general automaton
Математика: общий автомат -
3 general automaton
мат. -
4 automaton
-
5 общий автомат
Большой англо-русский и русско-английский словарь > общий автомат
-
6 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
7 kernel
1) зерно, зёрнышко2) керн3) матем. кернфункция4) сердцевина; ядро•kernel on the left — алг. ядро слева
kernel on the right — алг. ядро справа
kernel with a summable square — алг. ядро с суммируемым квадратом
- intrinsically singular kernel - kernel of a linear operator - kernel of a singular integral - kernel of a summation method - kernel of integral operator - kernel of integral transformation - locally finite kernel - nonpositive definite kernel - proper covariance kernelkernel with a weak singularity — алг. ядро со слабой особенностью
-
8 matrix
1) мат. матрица || матричный2) форма, шаблон4) растр5) решётка6) таблица7) геол. материнская порода, основная масса ( породы)8) основа кристаллического вещества; кристаллическая решётка•- absolutely equivalent matrices - adjoint matrices - almost perfect matrix - almost periodic matrix - almost superdiagonal matrix - associative matrix - birth-death coefficient matrix - cocycle matrix - commutative matrix - commute matrices - commuting matrix - complex conjugate matrix - compound matrix - conjunctive matrices - consistently ordered matrix - constituent matrices - deficient matrix - doubly degenerated matrix - doubly stochastic matrix - encoding matrix - essentially positive matrix - magnetic core matrix - matrix of linear transformation - multiplicatively cogredient matrix - multiply degenerate matrix - mutually consistent matrices - nearly triangular matrix - negatively semidefinite matrix - nonnegatively semidefinite matrix - orthogonally similar matrices - positively definite matrix - positively semidefinite matrix - regularly partitioned matrix - strictly upper triangular matrix - strongly equivalent matrices - totally nonnegative matrix - totally positive matrix - totally unimodular matrix - uniformly tapered matrix - vertex incidence matrix - vertically symmetrical matrix - weakly cyclic matrix
См. также в других словарях:
Automaton — This article is about a self operating machine. For other uses of Automaton, see Automaton (disambiguation) or Automata (disambiguation). An automaton (plural: automata or automatons ) is a self operating machine. The word is sometimes used to… … Wikipedia
automaton — automatous, adj. /aw tom euh ton , tn/, n., pl. automatons, automata / teuh/. 1. a mechanical figure or contrivance constructed to act as if by its own motive power; robot. 2. a person or animal that acts in a monotonous, routine manner, without… … Universalium
Probabilistic automaton — In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition… … Wikipedia
Cyclic cellular automaton — A one dimensional cyclic cellular automaton with n = 4, run for 300 steps from a random initial configuration. The cyclic cellular automaton is a cellular automaton rule developed by David Griffeath and studied by several other cellular automaton … Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
Hybrid automaton — A hybrid automaton (plural hybrid automata) is a mathematical model for precisely describing systems where computational processes interact with physical processes. Its behavior consists of discrete state transitions and continuous… … Wikipedia
Von Neumann cellular automaton — Von Neumann cellular automata are the original expression of cellular automata, the development of which were prompted by suggestions made to John von Neumann by his close friend and fellow mathematician Stanisław Ulam. Their original purpose was … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… … Wikipedia
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia